Search results for "model [neutrino]"
showing 10 items of 1203 documents
Long Term Outcome after Application of the Angio-Seal Vascular Closure Device in Minipigs
2016
PLoS one 11(9), e0163878 (2016). doi:10.1371/journal.pone.0163878
Graphical Template Language for Transformation Synthesis
2010
Higher-Order Transformations (HOT) have become an important support for the development of model transformations in various transformation languages. Most frequently HOTs are used to synthesize transformations from different kinds of models, for example, mapping models. This means that model driven development (MDD) is being successfully applied to transformations themselves too. The standard HOT solution is to create the transformation as a model using the abstract syntax. However, for graphical transformation languages a significantly more efficient solution would be to create the transformation using its graphical (concrete) syntax. An analogy could be the textual template languages such…
epiModel: A system to build automatically systems of differential equations of compartmental type-epidemiological models
2011
In this paper we describe epiModel, a code developed in Mathematica that facilitates the building of systems of differential equations corresponding to type-epidemiological linear or quadratic models whose characteristics are defined in text files following an easy syntax. It includes the possibility of obtaining the equations of models involving age and/or sex groups. © 2011.
Chromatin modifiers and recombination factors promote a telomere fold-back structure, that is lost during replicative senescence.
2020
Telomeres have the ability to adopt a lariat conformation and hence, engage in long and short distance intra-chromosome interactions. Budding yeast telomeres were proposed to fold back into subtelomeric regions, but a robust assay to quantitatively characterize this structure has been lacking. Therefore, it is not well understood how the interactions between telomeres and non-telomeric regions are established and regulated. We employ a telomere chromosome conformation capture (Telo-3C) approach to directly analyze telomere folding and its maintenance in S. cerevisiae. We identify the histone modifiers Sir2, Sin3 and Set2 as critical regulators for telomere folding, which suggests that a dis…
Weyl Type Theorems for Left and Right Polaroid Operators
2010
A bounded operator defined on a Banach space is said to be polaroid if every isolated point of the spectrum is a pole of the resolvent. In this paper we consider the two related notions of left and right polaroid, and explore them together with the condition of being a-polaroid. Moreover, the equivalences of Weyl type theorems and generalized Weyl type theorems are investigated for left and a-polaroid operators. As a consequence, we obtain a general framework which allows us to derive in a unified way many recent results, concerning Weyl type theorems (generalized or not) for important classes of operators.
Classical and Quantum Computations with Restricted Memory
2018
Automata and branching programs are known models of computation with restricted memory. These models of computation were in focus of a large number of researchers during the last decades. Streaming algorithms are a modern model of computation with restricted memory. In this paper, we present recent results on the comparative computational power of quantum and classical models of branching programs and streaming algorithms.
Statistically validated networks in bipartite complex systems.
2011
Many complex systems present an intrinsic bipartite nature and are often described and modeled in terms of networks [1-5]. Examples include movies and actors [1, 2, 4], authors and scientific papers [6-9], email accounts and emails [10], plants and animals that pollinate them [11, 12]. Bipartite networks are often very heterogeneous in the number of relationships that the elements of one set establish with the elements of the other set. When one constructs a projected network with nodes from only one set, the system heterogeneity makes it very difficult to identify preferential links between the elements. Here we introduce an unsupervised method to statistically validate each link of the pr…
Incorporating hypothetical knowledge into the process of inductive synthesis
1996
The problem of inductive inference of functions from hypothetical knowledge is investigated in this paper. This type of inductive inference could be regarded as a generalization of synthesis from examples that can be directed not only by input/output examples but also by knowledge of, e. g., functional description's syntactic structure or assumptions about the process of function evaluation. We show that synthesis of this kind is possible by efficiently enumerating the hypothesis space and illustrate it with several examples.
Learning multiresolution schemes for compression of images
2007
We introduce a new type of multiresolution based on the Harten's framework using learning theory. This changes the point of view of the classical multiresolution analysis and it transforms an approximation problem in a learning problem opening great possibilities. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
Researching Conditional Probability Problem Solving
2014
The chapter is organized into two parts. In the first one, the main protagonist is the conditional probability problem. We show a theoretical study about conditional probability problems, identifying a particular family of problems we call ternary problems of conditional probability. We define the notions of Level, Category and Type of a problem in order to classify them into sub-families and in order to study them better. We also offer a tool we call trinomial graph that functions as a generative model for this family of problems. We show the syntax of the model that allows researchers and teachers to translate a problem in terms of the trinomial graphs language, and the consequences of th…